Gibbs Random Fields with Unbounded Spins on Unbounded Degree Graphs
نویسندگان
چکیده
منابع مشابه
Packing trees of unbounded degrees in random graphs
In this paper, we address the problem of packing large trees in Gn,p. In particular, we prove the following result. Suppose that T1, . . . , TN are n-vertex trees, each of which has maximum degree at most (np)/(log n). Then with high probability, one can find edge-disjoint copies of all the Ti in the random graph Gn,p, provided that p > (log n)/n and N 6 (1 − ε)np/2 for a positive constant ε. M...
متن کاملPseudo-Random Function Generators With Unbounded Inputs
Definition: (See Goldreich, section 3.6.4.2 .) A function generator F with unbounded inputs associates with each n bit key k ∈ {0, 1} a function Fk : {0, 1}∗ → {0, 1}. We insist that Fk(x) be computable in time polynomial in the lengths of k and x. By pseudo-random for such a generator, we mean the obvious thing: the Distinguisher adversary D is given a function f : {0, 1}∗ → {0, 1} and can que...
متن کاملPseudo-Random Function Generators With Unbounded Inputs
Definition: (See Goldreich, section 3.6.4.2 .) A function generator F with unbounded inputs associates with each n bit key k ∈ {0, 1} a function Fk : {0, 1}∗ → {0, 1}. We insist that Fk(x) be computable in time polynomial in the lengths of k and x. By pseudo-random for such a generator, we mean the obvious thing: the Distinguisher adversary D is given a function f : {0, 1}∗ → {0, 1} and can que...
متن کاملThe Divergence Theorem for Unbounded Vector Fields
In the context of Lebesgue integration, we derive the divergence theorem for unbounded vector fields that can have singularities at every point of a compact set whose Minkowski content of codimension greater than two is finite. The resulting integration by parts theorem is applied to removable sets of holomorphic and harmonic functions. In the context of Lebesgue integration, powerful divergenc...
متن کاملDirected VR-Representable Graphs have Unbounded Dimension
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. A three-dimensional visibility representation that has been studied is one in which each vertex of the graph maps to a closed rectangle in R 3 and edges are expressed by vertical visibility between rectangles. The rectangles representing vertices are disjoin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2010
ISSN: 0021-9002,1475-6072
DOI: 10.1239/jap/1285335414